CO 250

Introduction
Week 1-A Formulations
Week 1-B Formulation & Multiperiod Models
Week 1-C Multiperiod Models and Integer Programs
Week 2-A IP & Graphs
Week 2-B Shortest Paths
Week 2-C Cost Matchings and Cost Perfect Matchings
Week 3-A Linear Programming: Possible Outcomes
Week 3-B Certificates for LP in Standard Equality Form
Week 4-A Certificates, Standard Forms & Geometry
Week 4-B Geometry & Simplex Method
Week 4-C Simplex Method, Basis
Week 5-A Simplex method
Week 5-B Simplex Method
Week 5-C Simplex Algorithm with Unbounded LP
Week 6-A Two Phase Method
Week 6-B Two Phase Method, Tableau & Pivoting
Week 6-C Tableau Method
Week 7-A Certifying infeasible LPs/Systems & Duality
Week 7-B Midterm Review
Week 7-C Duality
Week 8-A Duality
Week 8-B Duality: Fine Points
Week 8-C Duality & Complementary Slackness Conditions
Week 9-B Complementary Slack Conditions, Geometry & Duality
Week 9-C CS Conditions &Farka's Lemma
Week 10-A Farkas' Lemma & Shortest Paths
Week 10-B Shortest Path
Week 10-C Shortest Paths
Week 11-A Solving Integer Programs
Week 11-B Integer Programs
Week 11-C Cutting Plane Algorithm
Week 12-A Non-Linear Programs
Week 12-B Convex Functions, Convex Sets, NLP
Week 12-C NLP & Subgradients
Week 13-A
Course Note Summaries
1.1
1.2
1.3